A Class of _F-ary Convolutional Codes for Finite State 1S1 . Channels

ABSTRA CT— This paper presents F-ary convolutional codes for optimal decoding of pulse-amplitude-modulated (PAM) sequences over noisy finite intersymbol interference (1S1) channels. We refer to this new class of codes as ‘Optimal Convolutional Codes 9 (OCCS) for a channel in the sense of maximizing the minimum Euclidean Distance (ED), drni., between channel output sequences corresponding to distinct input message sequences at the Vkerbi detector, super-trellis of convolutional encoder and channel. Due to mismatch between the base fields of convolutional encoder and channel, without resorting analytical methods, exhaustive computer search algorithm is proposed on a set of convolutional encoders, called ‘Standard Trellis’, which have a specific structure in common. This trellis structure offers good properties in finding dmin of a code associated with a given encoder. This search scheme, as an example, is applied to 1 +4D +D2 channel, and search results are shown that the coding gains achieved are comparable to those of the best convolutional codes in perfect response channel. To overcome the high computational complexity of optimal MLSE decoding, new simple and efficient reduced state suboptimal decoding algorithm is also suggested.